Solution to Unit Commitment Problem with Spinning Reserve and Ramp Rate Constraints Using Ant Colony System

نویسندگان

  • S. P. Simon
  • N. P. Padhy
  • R. S. Anand
چکیده

In this paper unit commitment problem (UCP) with spinning reserve and ramp rate constraint has been solved using Ant Colony System (ACS). In this model, foraging behavior of the real ants for finding its food from its start (nest) to its destination (food) is simulated to obtain the optimum solution. A search strategy has been adopted which involves the artificial ants to obtain the minimum cost path for the commitment of thermal units for the given time period. The search space is seen as the multi stage decision, which provides the ant search a competitive edge over conventional Dynamic programming (DP) method. In the first step all possible combinations of the states satisfying the load demand with spinning reserve have been selected for ants search space. Then the artificial ants are allowed to explore the minimum cost path in that search space. The proposed ACS model has performed successfully for a ten-unit generation system and may be extended to practical systems with large number of units. ______________________________________________________________________________________

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliability-Constrained Unit Commitment Considering Interruptible Load Participation

From the optimization point of view, an optimum solution of the unit commitment problem with reliability constraints can be achieved when all constraints are simultaneously satisfied rather than sequentially or separately satisfying them. Therefore, the reliability constraints need to be appropriately formulated in terms of the conventional unit commitment variables. In this paper, the reli...

متن کامل

Evolving ant colony optimization based unit commitment

Ant colony optimization (ACO) was inspired by the observation of natural behavior of real ants’ pheromone trail formation and foraging. Ant colony optimization ismore suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem. Multistage decision making of ACO gives an edge over other conventional methods. This paper proposes evolving ant col...

متن کامل

Modified Ant Colony Optimization Technique for Solving Unit Commitment Problem

Ant colony optimization (ACO) which is inspired by the natural behavior of ants in finding the shortest path to food is appropriate for solving the combinatorial optimization problems. Therefore, it is used to solve the unit commitment problem (UCP) and attain the minimum cost for scheduling thermal units in order to produce the demand load. In this paper modified ACO (MACO) is used to solve th...

متن کامل

Unit Commitment by Evolving Ant Colony Optimization

Ant Colony Optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem, and multistage decision making of ACO has an edge over other conventional methods. In this paper, the authors propose the Evolving Ant Colony Optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs Genetic Algorithm (GA) f...

متن کامل

راهبرد پیشنهاد‌دهی همزمان نیروگاه مجازی در بازار انرژی و خدمات جانبیِ رزرو چرخان و توان راکتیو

This paper addresses the bidding problem faced by a virtual power plant (VPP) in energy, spinning reserve service, and reactive power service market simultaneously. Therefore, a non-equilibrium model based on security constraints price-based unit commitment (SCPBUC), which is take into account the supply-demand balancing and security constraints of VPP, is proposed. By the presented model, VPP ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009